Classical realizability and arithmetical formulæ
نویسندگان
چکیده
منابع مشابه
Classical realizability and arithmetical formul{\ae}
In this paper we treat the specification problem in classical realizability (as defined in [20]) in the case of arithmetical formulae. In the continuity of [10] and [11], we characterize the universal realizers of a formula as being the winning strategies for a game (defined according to the formula). In the first section we recall the definition of classical realizability, as well as a few tec...
متن کاملRealizing arithmetical formulæ
Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical realizability Realizability game Zoology Gender equality Introduction Curry-Howard Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical ...
متن کاملVerificationism and classical realizability
This paper investigates the question of whether Krivine’s classical realizability can provide a verificationist interpretation of classical logic. We argue that this kind of realizability can be considered an adequate candidate for this semantic role, provided that the notion of verification involved is no longer based on proofs, but on programs. On this basis, we show that a special reading of...
متن کاملQuantum Monodromy and Semi-classical Trace Formulæ
Trace formulæ provide one of the most elegant descriptions of the classical-quantum correspondence. One side of a formula is given by a trace of a quantum object, typically derived from a quantum Hamiltonian, and the other side is described in terms of closed orbits of the corresponding classical Hamiltonian. In algebraic situations, such as the original Selberg trace formula, the identities ar...
متن کاملQuantitative classical realizability
Introduced by Dal Lago and Hofmann, quantitative realizability is a technique used to define models for logics based on Multiplicative Linear Logic. A particularity is that functions are interpreted as bounded time computable functions. It has been used to give new and uniform proofs of soundness of several type systems with respect to certain time complexity classes. We propose a reformulation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2016
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129515000559